Parallel QR processing of Generalized Sylvester matrices
نویسندگان
چکیده
منابع مشابه
A Parallel Qr-factorization/solver of Quasiseparable Matrices
Abstract. This manuscript focuses on the development of a parallel QR-factorization of structured rank matrices, which can then be used for solving systems of equations. First, we will prove the existence of two types of Givens transformations, named rank decreasing and rank expanding Givens transformations. Combining these two types of Givens transformations leads to different patterns for ann...
متن کاملVery cleanness of generalized matrices
An element $a$ in a ring $R$ is very clean in case there exists an idempotent $ein R$ such that $ae = ea$ and either $a- e$ or $a + e$ is invertible. An element $a$ in a ring $R$ is very $J$-clean provided that there exists an idempotent $ein R$ such that $ae = ea$ and either $a-ein J(R)$ or $a + ein J(R)$. Let $R$ be a local ring, and let $sin C(R)$. We prove that $Ain K_...
متن کاملGeneralized parallel selection in sorted matrices
This paper presents a parallel algorithm running in time O(logmlog* m(log1ogm + log(n/m))) time on an ERE W PRAM with O(m/(log m log* m)) processors for the problem of selection in an m x n matrix with sorted rows and columns, m 5 n. Our algorithm generalizes the result of Sarnath and He [13] for selection in a sorted matrix of equal dimensions, and thus answers the open question they posted. T...
متن کاملOn the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملOn Permanents of Sylvester Hadamard Matrices
It is well-known that a Sylvester Hadamard matrix can be described by means of a cocycle. In this paper it is shown that the additional internal structure in a Sylvester Hadamard matrix, provided by the cocycle, is su cient to guarantee some kind of reduction in the computational complexity of calculating its permanent using Ryser's formula. A Hadamard matrix H of order n is an n× n matrix with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.11.051